A note on Hamiltonian circuits
نویسندگان
چکیده
Proof. Let G satisfy the hypothesis of Theorem 1. Clearly, G contains a circuit ; let C be the longest one . If G has no Hamiltonian circuit, there is a vertex x with x ~ C . Since G is s-connected, there are s paths starting at x and terminating in C which are pairwise disjoint apart from x and share with C just their terminal vertices x l, X2, . . ., x s (see [ 11, Theorem 1) . For each i = 1, 2, . . ., s, let y i be the successor of x i in a
منابع مشابه
Modeling of Substrate Noise Impact on a Single-Ended Cascode LNA in a Lightly Doped Substrate (RESEARCH NOTE)
Substrate noise generated by digital circuits on mixed-signal ICs can disturb the sensitiveanalog/RF circuits, such as Low Noise Amplifier (LNA), sharing the same substrate. This paperinvestigates the adverse impact of the substrate noise on a high frequency cascode LNA laid out on alightly doped substrate. By studying the major noise coupling mechanisms, a new and efficientmodeling method is p...
متن کاملAn Algorithm Which Generates the Hamiltonian Circuits of a Cubic Planar Map
The paper describes an algorithm which generates those Hamiltonian circuits of a given cubic planar map which include some chosen edge of the map. A simple extension of the method results in the generation of all the Hamiltonian circuits of the map. The algorithm can readily be implemented on a digital computer, subject to limitations on storage. A general property of the generating function de...
متن کاملLow Power March Memory Test Algorithm for Static Random Access Memories (TECHNICAL NOTE)
Memories are most important building blocks in many digital systems. As the Integrated Circuits requirements are growing, the test circuitry must grow as well. There is a need for more efficient test techniques with low power and high speed. Many Memory Built in Self-Test techniques have been proposed to test memories. Compared with combinational and sequential circuits memory testing utilizes ...
متن کاملSymmetrical, Low-Power, and High-Speed 1-Bit Full Adder Cells Using 32nm Carbon Nanotube Field-effect Transistors Technology (TECHNICAL NOTE)
Carbon nanotube field-effect transistors (CNFETs) are a promising candidate to replace conventional metal oxide field-effect transistors (MOSFETs) in the time to come. They have considerable characteristics such as low power consumption and high switching speed. Full adder cell is the main part of the most digital systems as it is building block of subtracter, multiplier, compressor, and other ...
متن کاملThe Covering Radius of the Cycle Code of a Graph
SolC. P. and T. Zaslavsky, The covering radius of the cycle code of a graph, Discrete Applied Mathematics 45 (I 993) 63-70. The cycle code of a graph is the binary linear span of the characteristic vectors of circuits. We exploit a connection between the covering radius of this code and minimum T-joins. We obtain a lower bound on the covering radius which is met with equality when the graph is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 2 شماره
صفحات -
تاریخ انتشار 1972